Nash equilibria in N-person games without convexity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distribution of pure Nash equilibria in n-person games with random best responses

In this paper we study the number of pure strategy Nash equilibria in large finite n-player games. A distinguishing feature of our study is that we allow general potentially multivalued best reply corresponsences. Given the number K of pure strategies to each player, we assign to each player a distribution over the number of his pure best replies against each strategy profile of his opponents. ...

متن کامل

A three-person deterministic graphical game without Nash equilibria

We give an example of a three person chess-like game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique cycle and three terminal positions), and its normal form is of size 2×2×4 only. Thus, our example strengthens significantly the one obtained in 2014 by Gurvich and Oudalov, which has four players, five terminals, and 2×4×6×8 norma...

متن کامل

Existence of Nash equilibria with C-convexity

The purpose of this paper is to introduce general C-convex and C-concave conditions, and then to prove two existence theorems of Nash equilibria in generalized games with C-concavity. Our results generalize the corresponding results due to Nash, Forgó, Takahashi and Kim–Lee in several ways. 2005 Elsevier Ltd. All rights reserved.

متن کامل

Nash Equilibria and Improvement Dynamics in Congestion Games Nash Equilibria and Improvement Dynamics in Congestion Games

Communication infrastructures and markets are maintained and used by millions of entities each of them facing a private objective. The vast number of participants in conjunction with their individual goals to choose the best alternative gave rise to study such scenarios in the framework of game theory as it is rather unrealistic to assume that a centrally computed solution can be implemented. I...

متن کامل

Constrained Markov Games: Nash Equilibria

In this paper we develop the theory of constrained Markov games. We consider the expected average cost as well as discounted cost. We allow diierent players to have different types of costs. We present suucient conditions for the existence of stationary Nash equilibrium. Our results are based on the theory of sensitivity analysis of mathematical programs developed by Dantzig, Folkman and Shapir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1992

ISSN: 0893-9659

DOI: 10.1016/0893-9659(92)90067-j